Contracting Nonlinear Observers: Convex Optimization and Learning from Data
نویسنده
چکیده
A new approach to design of nonlinear observers (state estimators) is proposed. The main idea is to (i) construct a convex set of dynamical systems which are contracting observers for a particular system, and (ii) optimize over this set for one which minimizes a bound on state-estimation error on a simulated noisy data set. We construct convex sets of continuous-time and discrete-time observers, as well as contracting sampled-data observers for continuous-time systems. Convex bounds for learning are constructed using Lagrangian relaxation. The utility of the proposed methods are verified using numerical simulation.
منابع مشابه
Orbit Learning using Convex Optimization
Recently, learning approaches have been brought to bear on nonlinear datasets by assuming samples lie on a low-dimensional Riemannian manifold in the embedding space. One solution is to model local variations linearly [1]. A fundamental difficulty with such solutions is they cannot extrapolate or generalize far from the training data when the manifold is curved. Consequently, the manifold needs...
متن کاملOn Existence of Separable Contraction Metrics for Monotone Nonlinear Systems
Finding separable certificates of stability is important for tractability of analysis methods for large-scale networked systems. In this paper we consider the question of when a nonlinear system which is contracting, i.e. all solutions are exponentially stable, can have that property verified by a separable metric. Making use of recent results in the theory of positive linear systems and separa...
متن کاملRobust Classification of Graph-Based Data
A graph-based classification method is proposed both for semi-supervised learning in the case of Euclidean data and for classification in the case of graph data. Our manifold learning technique is based on a convex optimization problem involving a convex regularization term and a concave loss function with a trade-off parameter carefully chosen so that the objective function remains convex. As ...
متن کاملAn Introduction to Nonlinear Dimensionality Reduction by Maximum Variance Unfolding
Many problems in AI are simplified by clever representations of sensory or symbolic input. How to discover such representations automatically, from large amounts of unlabeled data, remains a fundamental challenge. The goal of statistical methods for dimensionality reduction is to detect and discover low dimensional structure in high dimensional data. In this paper, we review a recently proposed...
متن کاملModified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers
Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering in which there is no need to be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1711.08135 شماره
صفحات -
تاریخ انتشار 2017